Cryptanalysis of Ladder-DES

نویسنده

  • Eli Biham
چکیده

Feistel ciphers are very common and very important in the design and analysis of blockciphers, especially due to four reasons: (1) Many (DES-like) ciphers are based on Feistel's construction. (2) Luby and Rackoo proved the security of a four-round Feistel construction when the round functions are random. (3) Recently several provably secure ciphers were suggested, which use other (assumed secure) ciphers as the round function. (4) Other such ciphers use this construction as attempts to improve the security of other ciphers (e.g., to improve the security of DES). In this paper we cryptanalyze Ladder-DES, a four-rounds Feistel cipher using DES in the round function, and show that its security is smaller than expected.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cryptanalysis of S-DES

This paper describes an effort to attack S-DES using differential cryptanalysis and linear cryptanalysis. S-DES is a reduced version of the Data Encryption Standard (DES). It also includes a discussion on the subject of cryptology and a literature survey of useful papers regarding cryptography and cryptanalysis. This paper is meant as a tutorial on the fundamentals of differential cryptanalysis...

متن کامل

Comparative Study on Data Encryption Standard Using Differential Cryptanalysis and Linear Cryptanalysis

This paper presents an approach for the comparative study on Data Encryption Standard (DES) using Differential Cryptanalysis and Linear cryptanalysis. In this paper, cipher text only attack is adopted and varieties of optimum keys are generated based on the cost function values. The goal of this paper is two fold. First we want to make a study about how evolutionary computation techniques can e...

متن کامل

Applying Diierential Cryptanalysis to Des Reduced to 5 Rounds

Diierential cryptanalysis is a powerful attack developed by Eli Biham and Adi Shamir. It has been successfully applied to many DES-like cryptosystems. We provide a brief introduction to their paper BS91] and show how to apply diierential cryptanalysis to attack the Data Encryption Standard (DES) reduced to 5 rounds.

متن کامل

Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES

We present new attacks on key schedules of block ciphers. These attacks are based on the principles of related-key differential cryptanalysis: attacks that allow both keys and plaintexts to be chosen with specific differences. We show how these attacks can be exploited in actual protocols and cryptanalyze the key schedules of a variety of algorithms, including three-key triple-DES.

متن کامل

Application of PVM to Linear Cryptanalysis of DES

Data Encryption Standard (DES) is the most widely used cryptographic algorithm. Recently, Matsui 8] showed that the algorithm is not secure under a plaintext attack, called linear cryptanalysis. In this paper we show that this attack can be implemented as a concurrent program and hence the required time for breaking DES can be eeectively reduced by employing a parallel computing environment.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997